The fairness‐accuracy Pareto front
نویسندگان
چکیده
Algorithmic fairness seeks to identify and correct sources of bias in machine learning algorithms. Confoundingly, ensuring often comes at the cost accuracy. We provide formal tools this work for reconciling fundamental tension algorithm fairness. Specifically, we put use concept Pareto optimality from multiobjective optimization seek fairness-accuracy front a neural network classifier. demonstrate that many existing algorithmic methods are performing so-called linear scalarization scheme, which has severe limitations recovering optimal solutions. instead apply Chebyshev scheme is provably superior theoretically no more computationally burdensome solutions compared scheme.
منابع مشابه
Computing the Complete Pareto Front
We give an efficient algorithm to enumerate all elements of a Pareto front in a multi-objective optimization problem in which the space of values is finite for all objectives. Our algorithm uses a feasibility check for a search space element as an oracle and minimizes the number of oracle calls that are necessary to identify the Pareto front of the problem. Given a k-dimensional search space in...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملPareto Front Identification from Stochastic Bandit Feedback
We consider the problem of identifying the Pareto front for multiple objectives from a finite set of operating points. Sampling an operating point gives a random vector where each coordinate corresponds to the value of one of the objectives. The Pareto front is the set of operating points that are not dominated by any other operating point in respect to all objectives (considering the mean of t...
متن کاملThe geometry of the Pareto front in biological phenotype space
When organisms perform a single task, selection leads to phenotypes that maximize performance at that task. When organisms need to perform multiple tasks, a trade-off arises because no phenotype can optimize all tasks. Recent work addressed this question, and assumed that the performance at each task decays with distance in trait space from the best phenotype at that task. Under this assumption...
متن کاملApproximating the Nondominated Front Using the Pareto Archived Evolution Strategy
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its simplest form, is a (1 + 1) evolution strategy employing local search but using a reference archi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining
سال: 2021
ISSN: ['1932-1864', '1932-1872']
DOI: https://doi.org/10.1002/sam.11560